Superlinear Convergence Rates for the Lanczos Method Applied to Elliptic Operators
نویسنده
چکیده
This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic diierential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem. These results are illustrated numerically for a more diicult problem.
منابع مشابه
Mesh Independent Superlinear PCG Rates Via Compact-Equivalent Operators
The subject of the paper is the mesh independent convergence of the preconditioned conjugate gradient method for nonsymmetric elliptic problems. The approach of equivalent operators is involved, in which one uses the discretization of another suitable elliptic operator as preconditioning matrix. By introducing the notion of compact-equivalent operators, it is proved that for a wide class of ell...
متن کاملSharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the rates of convergence good for a few extreme eigenpairs. These bounds suggest at least linear convergence in terms of the number of Lanczos steps, assuming there are gaps between individual eigenvalues. In practice, o...
متن کاملSuperlinear PCG algorithms: symmetric part preconditioning and boundary conditions
The superlinear convergence of the preconditioned CGM is studied for nonsymmetric elliptic problems (convection-diffusion equations) with mixed boundary conditions. A mesh independent rate of superlinear convergence is given when symmetric part preconditioning is applied to the FEM discretizations of the BVP. This is the extension of a similar result of the author for Dirichlet problems. The di...
متن کاملSuperlinearly convergent PCG algorithms for some nonsymmetric elliptic systems
The conjugate gradient method is a widespread way of solving nonsymmetric linear algebraic systems, in particular for large systems arising from discretized elliptic problems. A celebrated property of the CGM is superlinear convergence, see the book [2] where a comprehensive summary is given on the convergence of the CGM. For discretized elliptic problems, the CGM is mostly used with suitable p...
متن کاملSharpness in Rates of Convergence For CG and Symmetric Lanczos Methods
Conjugate Gradient (CG) method is often used to solve a positive definite linear system Ax = b. Existing bounds suggest that the residual of the kth approximate solution by CG goes to zero like [( √ κ− 1)/(√κ + 1)], where κ ≡ κ(A) = ‖A‖2‖A−1‖2 is A’s spectral condition number. It is well-known that for a given positive definite linear system, CG may converge (much) faster, known as superlinear ...
متن کامل